Fast Approximation for Toeplitz, Tridiagonal, Symmetric and Positive Definite Linear Systems that Grow Over Time
نویسندگان
چکیده
منابع مشابه
Fast Approximation for Toeplitz, Tridiagonal, Symmetric and Positive Definite Linear Systems that Grow Over Time
Linear systems with tridiagonal structures are very common in problems related not only to engineering, but chemistry, biomedical or finance, for example, real time cubic B-Spline interpolation of ND-images, real time processing of Electrocardiography (ECG) and hand drawing recognition. In those problems which the matrix is positive definite, it is possible to optimize the solution in O(n) time...
متن کاملOn the Worst-case Convergence of Mr and Cg for Symmetric Positive Definite Tridiagonal Toeplitz Matrices
We study the convergence of the minimal residual (MR) and the conjugate gradient (CG) method when applied to linear algebraic systems with symmetric positive definite tridiagonal Toeplitz matrices. Such systems arise, for example, from the discretization of one-dimensional reaction-diffusion equations with Dirichlet boundary conditions. Based on our previous results in [J. Liesen and P. Tichý, ...
متن کاملParallel Numerical Algorithms for Symmetric Positive Definite Linear Systems
We give a matrix factorization for the solution of the linear system Ax = f , when coefficient matrix A is a dense symmetric positive definite matrix. We call this factorization as "WW T factorization". The algorithm for this factorization is given. Existence and backward error analysis of the method are given. The WDWT factorization is also presented. When the coefficient matrix is a symmetric...
متن کاملA fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...
متن کاملSome algorithms for solving special tridiagonal block Toeplitz linear systems
This paper is focused on di1erent methods and algorithms for solving tridiagonal block Toeplitz systems of linear equations. We consider the El-Sayed method (Ph.D. Thesis, 1996) for such systems and propose several modi9cations that lead to di1erent algorithms, which we discuss in detail. Our algorithms are then compared with some classical techniques as far as implementation time is concerned,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2016
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2016.071145